1368A - C+= - CodeForces Solution

brute force greedy implementation math *800

Please click on ads to support us..

Python Code: 

for g in[*open(0)][1:]:
    a,b,n=map(int,g.split())
    x=max(a,b)
    y=min(a,b)
    t = 0
    a = 1
    while x <= n and y <= n:
        if a:
            y += x
        else:
            x += y
        t += 1
        a = 1-a
        
    print(t)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long int a,b,c,d,n,t,p,q,l;
    cin>>t;
    while(t--)
    {
        l=0;
        cin>>a>>b>>n;
        while(max(a,b)<=n)
        {
            if(a<b)
                a=a+b;
            else
                b=b+a;
            l++;
        }
        cout<<l<<endl;

    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1549A - Gregor and Cryptography
918C - The Monster
4B - Before an Exam
545B - Equidistant String
1244C - The Football Season
1696B - NIT Destroys the Universe
1674A - Number Transformation
1244E - Minimizing Difference
1688A - Cirno's Perfect Bitmasks Classroom
219A - k-String
952A - Quirky Quantifiers
451B - Sort the Array
1505H - L BREAK into program
171E - MYSTERIOUS LANGUAGE
630D - Hexagons
1690D - Black and White Stripe
1688D - The Enchanted Forest
1674C - Infinite Replacement
712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers